A cooperative GPU-based Parallel Multistart Simulated Annealing algorithm for Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is one of the well-known combinatorial optimization problems and is known for its various applications. In this paper, we propose a modified simulated annealing algorithm for the QAP – M-SA-QAP. The novelty of the proposed algorithm is an advanced formula of calculation of the initial and final temperatures, as well as an original cooling schedule with osc...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملA GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem
The quadratic assignment problem (QAP) is one of the most difficult combinatorial optimization problems. An effective heuristic for obtaining approximate solutions to the QAP is simulated annealing (SA). Here we describe an SA implementation for the QAP which runs on a graphics processing unit (GPU). GPUs are composed of low cost commodity graphics chips which in combination provide a powerful ...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Science and Technology, an International Journal
سال: 2018
ISSN: 2215-0986
DOI: 10.1016/j.jestch.2018.08.002